#include <iostream>
using namespace std;
#include "BinarySearchTree.h"
void TestBSTree1() {
	int a[] = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	key::BinarySearchTree<int> t;
	for (size_t i = 0; i < sizeof(a) / sizeof(int); ++i) {
		t.Insert(a[i]);
	}
	t.InOrder();
	for (size_t i = 0; i < sizeof(a) / sizeof(int); ++i) {
		t.EraseR(a[i]);
		t.InOrder();
	}

}
void TestBSTree2() {
	key_value::TestBSTree();
}
int main() {
	TestBSTree2();
	return 0;
}
